Automorphisms of tiled orders

On exponent matrices of tiled orders

A ring Λ is called a tiled order if Λ is a prime Noetherian semi-prefect semi-distributive ring with non-zero Jacobson radical. Any tiled order can be constructed from a (non-necessarily commutative) discrete valuation ring and an exponent matrix. The latter means a square integer matrix A = (αps), whose diagonal entries are equal to zero, and for all possible indices i, j, k, the following ine...

Reductibility and Orders of Periodic Automorphisms of Surfaces

Periodic Automorphisms of Surfaces: Invariant Circles and Maximal Orders

CONTENTS

ul 2 01 7 Computation of orders and cycle lengths of automorphisms of finite solvable groups

Let G be a finite solvable group, given through a refined consistent polycyclic presentation, and α an automorphism of G, given through its images of the generators of G. In this paper, we discuss practical deterministic algorithms for computing the order of α as well as the cycle length of a given element of G under α. Both algorithms proceed by recursion over a characteristic series in G with...

Tiled microprocessors